Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids
نویسندگان
چکیده
Abstract. We present a new analysis of the greedy algorithm for the problem of finding a minimum spanning subset in -polymatroids. This algorithm has a performance ratio of approximately , which is best possible for large . A consequence of this algorithm is a polynomial time approximation algorithm with approximation ratio for finding minimum weight spanning subhypergraphs in -restricted hypergraphs. This generalization of the well-known set cover problem naturally arises when computing Steiner minimum trees. Other applications of the algorithm include the rigidity problem in statics.
منابع مشابه
A 2-Isomorphism Theorem for Hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملSequence Hypergraphs
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs. Sequence hypergraphs are motivated by problems in public ...
متن کاملFlows on hypergraphs
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and fo...
متن کاملApproximating the minimum weight spanning tree of a set of points in the Hausdorff metric
We study the problem of approximating MST(P ), the minimum weight spanning tree of a set P of n points in [0, 1], by a spanning tree of some subset Q ⊂ P . We show that if the weight of MST(P ) is to be approximated, then in general Q must be large. If the shape of MST(P ) is to be approximated, then this is always possible with a small Q. More specifically, for any 0 < ε < 1 we prove: (i) Ther...
متن کامل